Given an integer array a[ ], find the
subarray
with the largest sum, and return its sum.
explanation: 01
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
write a code that satisfies the above constraints and explain it briefly about its time complexity.
